Benchmarking Neural Embeddings for Link Prediction in Knowledge Graphs Under Semantic and Structural Changes
نویسندگان
چکیده
Recently, link prediction algorithms based on neural embeddings have gained tremendous popularity in the Semantic Web community, and are extensively used for knowledge graph completion. While algorithmic advances strongly focused efficient ways of learning embeddings, fewer attention has been drawn to different their performance robustness can be evaluated. In this work we propose an open-source evaluation pipeline, which benchmarks accuracy situations where graphs may experience semantic structural changes. We define relation-centric connectivity measures that allow us connect capacity structure graph. Such pipeline is especially important simulate expected frequently updated.
منابع مشابه
Synthesizing Knowledge Graphs for Link and Type Prediction Benchmarking
Despite the growing amount of research in link and type prediction in knowledge graphs, systematic benchmark datasets are still scarce. In this paper, we propose a synthesis model for the generation of benchmark datasets for those tasks. Synthesizing data is a way of having control over important characteristics of the data, and allows the study of the impact of such characteristics on the perf...
متن کاملEfficient Learning of Entity and Predicate Embeddings for Link Prediction in Knowledge Graphs
Knowledge Graphs are a widely used formalism for representing knowledge in the Web of Data. We focus on the problem of predicting missing links in large knowledge graphs, so to discover new facts about the world. Recently, representation learning models that embed entities and predicates in continuous vector spaces achieved new state-of-the-art results on this problem. A major limitation in the...
متن کاملZero-shot Recognition via Semantic Embeddings and Knowledge Graphs
We consider the problem of zero-shot recognition: learning a visual classifier for a category with zero training examples, just using the word embedding of the category and its relationship to other categories, which visual data are provided. The key to dealing with the unfamiliar or novel category is to transfer knowledge obtained from familiar classes to describe the unfamiliar class. In this...
متن کاملEnsemble Solutions for Link-Prediction in Knowledge Graphs
Knowledge graphs store up to billions of facts and are used in an increasing number of applications including search and question answering. Besides the freely available knowledge graphs of the Linked Open Data Cloud, there are a number of commercial knowledge graphs as the Google Knowledge Graph and Microsoft’s Satori. Incompleteness is still a major issue in this graphs and has been the topic...
متن کاملSimplE Embedding for Link Prediction in Knowledge Graphs
The aim of knowledge graphs is to gather knowledge about the world and provide a structured representation of this knowledge. Current knowledge graphs are far from complete. To address the incompleteness of the knowledge graphs, link prediction approaches have been developed which make probabilistic predictions about new links in a knowledge graph given the existing links. Tensor factorization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2021
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.3769876